Time-Darts: A Data Structure for Verification of Closed Timed Automata

Time-Darts: A Data Structure for Verification of Closed Timed Automata

Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison, discretization offers an easy alternative, with all operations having linear-time complexity in the number of clocks, and yet valid for a large class of closed sy...

Data-Structures for Verification of Timed Automata

Data-Structures for the Verification of Timed Automata

In this paper we suggest numerical decision diagrams, a bdd-based data-structure for representing certain subsets of the Euclidean space, namely those encountered in veriication of timed automata. Unlike other representation schemes, ndd's are canonical and provide for all the necessary operations needed in the veriication and synthesis of timed automata. We report some preliminary experimental...

Verification for Timed Automata Extended with Unbounded Discrete Data Structures

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper i...

Verification of Two Real-Time Systems Using Parametric Timed Automata

In this paper we propose solutions to the FMTV challenge of a distributed video processing system using the formalism of Parametric Timed Automata (PTA). The first challenge is harder because of the very large number of states to be analysed, so we only provide upper bounds. The second challenge consists of a real-time scheduling problem for which we provide exact solutions by using a schedulin...